Delay-Minimizing Capacity Allocation in an Infinite Server-Queueing System
نویسندگان
چکیده
منابع مشابه
Server optimization of infinite queueing systems
The problem of optimizing Markovian models with infinitely or finite but infeasible large state space is considered. In several practically interesting cases the state space of the model is finite and extremely large or infinite, and the transition and decision structures have some regular property which can be exploited for efficient analysis and optimization. Among the Markovian models with r...
متن کاملBuffer and server allocation in general multi-server queueing networks
This paper deals with the joint optimization of the number of buffers and servers, an important issue since buffers and servers represent a significant amount of investment for many companies. The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables. The performance of the BCAP is evaluated by a combination of a two-moment appr...
متن کاملOptimal Server Allocation in General, Finite, Multi-Server Queueing Networks
Queueing networks with finite buffers, multiple servers, arbitrary acyclic, series-parallel topologies, and general service time distributions are considered in this paper. An approach to optimally allocate servers to series, merge, and split topologies and their combinations is demonstrated. The methodology builds upon two-moment approximations to the service time distribution embedded in the ...
متن کاملHeavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
We study an infinite-server fork-join queueing system with dependent services, which experiences alternating renewal service disruptions. Jobs are forked into a fixed number of parallel tasks upon arrival and processed at the corresponding parallel service stations with multiple servers. Synchronization of a job occurs when its parallel tasks are completed, i.e., non-exchangeable. Service times...
متن کاملInfinite-Server Queueing Tandem With MMPP Arrivals And Random Capacity Of Customers
Tandem of two queueing systems with infinite number of servers is considered. Customers arrive at the first stage of the tandem according to Markovian modulated Poisson process, and after a completion of their services, they go to the second stage. Each customer carries some data package with a random value (capacity of the customer). Service time does not depend on the customers’ capacities in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Systems
سال: 2019
ISSN: 1946-5238,1946-5238
DOI: 10.1287/stsy.2018.0020